A study on new computational local orders of convergence
نویسندگان
چکیده
Four new variants of the Computational Order of Convergence (COC) of a one-point iterative method with memory for solving nonlinear equations are presented. Furthermore, the way to approximate the new variants to the local order of convergence is analyzed. Three of the new definitions given here do not involve the unknown root. Numerical experiments using adaptive arithmetic with multiple precision and a stopping criteria are implemented without using any known root.
منابع مشابه
Two new three and four parametric with memory methods for solving nonlinear equations
In this study, based on the optimal free derivative without memory methods proposed by Cordero et al. [A. Cordero, J.L. Hueso, E. Martinez, J.R. Torregrosa, Generating optimal derivative free iterative methods for nonlinear equations by using polynomial interpolation, Mathematical and Computer Modeling. 57 (2013) 1950-1956], we develop two new iterative with memory methods for solving a nonline...
متن کاملSome New Existence, Uniqueness and Convergence Results for Fractional Volterra-Fredholm Integro-Differential Equations
This paper demonstrates a study on some significant latest innovations in the approximated techniques to find the approximate solutions of Caputo fractional Volterra-Fredholm integro-differential equations. To this aim, the study uses the modified Adomian decomposition method (MADM) and the modified variational iteration method (MVIM). A wider applicability of these techniques are based on thei...
متن کاملAxial buckling analysis of an isotropic cylindrical shell using the meshless local Petrov-Galerkin method
In this paper the meshless local Petrov-Galerkin (MLPG) method is implemented to study the buckling of isotropic cylindrical shells under axial load. Displacement field equations, based on Donnell and first order shear deformation theory, are taken into consideration. The set of governing equations of motion are numerically solved by the MLPG method in which according to a semi-inverse method, ...
متن کاملA novel computational procedure based on league championship algorithm for solving an inverse heat conduction problem
Inverse heat conduction problems, which are one of the most important groups of problems, are often ill-posed and complicated problems, and their optimization process has lots of local extrema. This paper provides a novel computational procedure based on finite differences method and league championship algorithm to solve a one-dimensional inverse heat conduction problem. At the beginning, we u...
متن کاملA HYBRID ALGORITHM FOR THE OPEN VEHICLE ROUTING PROBLEM
The open vehicle routing problem (OVRP) is a variance of the vehicle routing problem (VRP) that has a unique character which is its open path form. This means that the vehicles are not required to return to the depot after completing service. Because this problem belongs to the NP-hard problems, many metaheuristic approaches like the ant colony optimization (ACO) have been used to solve OVRP in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012